A Combinatorial Algorithm to Compute Regularization Paths
نویسندگان
چکیده
For a wide variety of regularization methods, algorithms computing the entire solution path have been developed recently. Solution path algorithms do not only compute the solution for one particular value of the regularization parameter but the entire path of solutions, making the selection of an optimal parameter much easier. Most of the currently used algorithms are not robust in the sense that they cannot deal with general or degenerate input. Here we present a new robust, generic method for parametric quadratic programming. Our algorithm directly applies to nearly all machine learning applications, where so far every application required its own different algorithm. We illustrate the usefulness of our method by applying it to a very low rank problem which could not be solved by existing path tracking methods, namely to compute part-worth values in choice based conjoint analysis, a popular technique from market research to estimate consumers preferences on a class of parameterized options.
منابع مشابه
Complexity Analysis of the Lasso Regularization Path
The regularization path of the Lasso can be shown to be piecewise linear, making it possible to “follow” and explicitly compute the entire path. We analyze in this paper this popular strategy, and prove that its worst case complexity is exponential in the number of variables. We then oppose this pessimistic result to an (optimistic) approximate analysis: We show that an approximate path with at...
متن کاملA Flexible Integrated Forward/ Reverse Logistics Model with Random Path-based Memetic Algorithm
Due to business and environmental issues, the efficient design of an integrated forward/reverse logistics network has recently attracted more attention from researchers. The significance of transportation cost and customer satisfaction spurs an interest in developing a flexible network design model with different delivery paths. This paper proposes a flexible mixed-integer programming model to ...
متن کاملAn Exponential Lower Bound on the Complexity of Regularization Paths
For a variety of regularization methods, algorithms computing the entire solution path have been developed recently. Solution path algorithms do not only compute the solution for one particular value of the regularization parameter but the entire path of solutions, making the selection of an optimal parameter much easier. It has been assumed that these piecewise linear solution paths have only ...
متن کاملSome Extensions of the All Pairs Bottleneck Paths Problem
We extend the well known bottleneck paths problem in two directions for directed unweighted (unit edge cost) graphs with positive real edge capacities. Firstly we narrow the problem domain and compute the bottleneck of the entire network in O(n log n) time, where O(n) is the time taken to multiply two n-by-n matrices over ring. Secondly we enlarge the domain and compute the shortest paths for a...
متن کاملImproved semidefinite bounding procedure for solving Max-Cut problems to optimality
We present an improved algorithm for finding exact solutions to Max-Cut and the related binary quadratic programming problem, both classic problems of combinatorial optimization. The algorithm uses a branch-(and-cut-)and-bound paradigm, using standard valid inequalities and nonstandard semidefinite bounds. More specifically, we add a quadratic regularization term to the strengthened semidefinit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/0903.4856 شماره
صفحات -
تاریخ انتشار 2009